Variance-Reduced Stochastic Learning by Networked Agents under Random Reshuffling
نویسندگان
چکیده
This work develops a fully decentralized variance-reduced learning algorithm foron-device intelligence where nodes store and process the data locally and are onlyallowed to communicate with their immediate neighbors. In the proposed algo-rithm, there is no need for a central or master unit while the objective is to enablethe dispersed nodes to learn the exact global model despite their limited localizedinteractions. The resulting algorithm is shown to have low memory requirement,guaranteed linear convergence, robustness to failure of links or nodes, scalabilityto the network size, and privacy-preserving properties. Moreover, the decentral-ized nature of the solution makes large-scale machine learning problems moretractable and also scalable since data is stored and processed locally at the nodes.
منابع مشابه
Stochastic Learning under Random Reshuffling
In empirical risk optimization, it has been observed that stochastic gradient implementations that rely on random reshuffling of the data achieve better performance than implementations that rely on sampling the data uniformly. Recent works have pursued justifications for this behavior by examining the convergence rate of the learning process under diminishing step-sizes. This work focuses on t...
متن کاملEvent-based Scheduling of Multi-loop Stochastic Systems over Shared Communication Channels*
Abstract—This paper introduces a novel dynamic eventbased scheduling mechanism for networked control systems (NCSs) composed of multiple linear heterogeneous stochastic plants whose feedback loops are closed over a shared constrained communication channel. Each subsystem competes for the channel access in order to update its own controller with true local state values. Employing an emulation-ba...
متن کاملStrategy-proof stochastic assignment
I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is ...
متن کاملDesigninga Neuro-Sliding Mode Controller for Networked Control Systems with Packet Dropout
This paper addresses control design in networked control system by considering stochastic packet dropouts in the forward path of the control loop. The packet dropouts are modelled by mutually independent stochastic variables satisfying Bernoulli binary distribution. A sliding mode controller is utilized to overcome the adverse influences of stochastic packet dropouts in networked control system...
متن کاملOF CAMBRIDGE Cambridge Working Papers in Economics
I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is ...
متن کامل